DROPS

Found 2 Possible Name Variants:

Mäs, Stephan
Stéphan, Thomassé

Mäs, Stephan

Document

Checking the Integrity of Spatial Integrity Constraints

Authors: Stephan Mäs

Published in: Dagstuhl Seminar Proceedings, Volume 7212, Constraint Databases, Geometric Elimination and Geographic Information Systems (2007)

Abstract

Integrity constraints play a major role when the quality of spatial data is checked by automatic procedures. Nevertheless the possibilities of checking the internal consistency of the integrity constraints themselves are hardly researched jet. This work analyses the applicability of reasoning techniques like the composition of spatial relations and constraint satisfaction in networks of constraints to find conflicts and redundancies in sets of spatial semantic integrity constraints. These integrity rules specify relations among entity classes. Such relations must hold to assure that the data is fitting to the semantics intended by the data model. For spatial data many semantic integrity constraints are based on spatial properties described for example through qualitative topological or metric relations. Since integrity constraints are defined at the class level, the reasoning properties of these spatial relations can not directly be applied. Therefore a set of class relations has been defined which, combined with the instance relations, enables for the specification of integrity constraints and to reason about them.

Cite as

Stephan Mäs. Checking the Integrity of Spatial Integrity Constraints. In Constraint Databases, Geometric Elimination and Geographic Information Systems. Dagstuhl Seminar Proceedings, Volume 7212, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{mas:DagSemProc.07212.5,
  author =	{M\"{a}s, Stephan},
  title =	{{Checking the Integrity of Spatial Integrity Constraints}},
  booktitle =	{Constraint Databases, Geometric Elimination and Geographic Information Systems},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7212},
  editor =	{Bernd Bank and Max J. Egenhofer and Bart Kuijpers},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07212.5},
  URN =		{urn:nbn:de:0030-drops-12859},
  doi =		{10.4230/DagSemProc.07212.5},
  annote =	{Keywords: Semantic Integrity Constraints, Spatial Relations, Class Level Relations, Reasoning, Consistency of Constraints, Constraint Networks}
}

Stéphan, Thomassé

Document

Invited Talk

DOI: 10.4230/LIPIcs.STACS.2013.3

Graph coloring, communication complexity and the stubborn problem (Invited Talk)

Authors: Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan

Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)

Abstract

We discuss three equivalent forms of the same problem arising in communication complexity, constraint satisfaction problems, and graph coloring. Some partial results are discussed.

Cite as

Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan. Graph coloring, communication complexity and the stubborn problem (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 3-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{bousquet_et_al:LIPIcs.STACS.2013.3,
  author =	{Bousquet, Nicolas and Lagoutte, Aur\'{e}lie and St\'{e}phan, Thomass\'{e}},
  title =	{{Graph coloring, communication complexity and the stubborn problem}},
  booktitle =	{30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
  pages =	{3--4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-50-7},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{20},
  editor =	{Portier, Natacha and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.3},
  URN =		{urn:nbn:de:0030-drops-39158},
  doi =		{10.4230/LIPIcs.STACS.2013.3},
  annote =	{Keywords: stubborn problem, graph coloring, Clique-Stable set separation, Alon-Saks-Seymour conjecture, bipartite packing}
}

Search Results

Documents authored by Mäs, Stephan

Mäs, Stephan

Checking the Integrity of Spatial Integrity Constraints

Abstract

Cite as

Stéphan, Thomassé

Graph coloring, communication complexity and the stubborn problem (Invited Talk)

Abstract

Cite as

Thanks for your feedback!

Could not send message